Enumerating totally clean words

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumerating totally clean words

Let A be a finite alphabet and let DcA * be a finite set of words to be labelled "dirty". Let {Xa: a E A} be commuting indeterminates. To every letter a E A we assign the weight Xa and the weight of a word is the product of the weights of its letters. For example, weight (13221) = X1X3X2X2X1 = XiX~X3. Given any set S of words we let weight (S) be the sum of the weights of the members of S. For ...

متن کامل

Enumerating Abelian Returns to Prefixes of Sturmian Words

We follow the works of Puzynina and Zamboni, and Rigo et al. on abelian returns in Sturmian words. We determine the cardinality of the set APRu of abelian returns of all prefixes of a Sturmian word u in terms of the coefficients of the continued fraction of the slope, dependingly on the intercept. We provide a simple algorithm for finding the set APRu and we determine it for the characteristic ...

متن کامل

The Equivalence between Enumerating Cyclically Symmetric, Self-Complementary and Totally Symmetric, Self-Complementary Plane Partitions

We prove that the number of cyclically symmetric, self-complementary plane partitions contained in a cube of side 2n equals the square of the number of totally symmetric, self-complementary plane partitions contained in the same cube, without explicitly evaluating either of these numbers. This appears to be the first direct proof of this fact. The problem of finding such a proof was suggested b...

متن کامل

Enumerating Vertices of $0/1$-Polyhedra associated with $0/1$-Totally Unimodular Matrices

We give an incremental polynomial time algorithm for enumerating the vertices of any polyhedron P(A, 1 ̄ ) = {x ∈ R | Ax ≥ 1 ̄ , x ≥ 0 ̄ }, when A is a totally unimodular matrix. Our algorithm is based on decomposing the hypergraph transversal problem for unimodular hypergraphs using Seymour’s decomposition of totally unimodular matrices, and may be of independent interest.

متن کامل

The existence totally reflexive covers

Let $R$ be a commutative Noetherian ring. We prove that  over a local ring $R$ every finitely generated $R$-module $M$ of finite Gorenstein projective dimension has a Gorenstein projective cover$varphi:C rightarrow M$ such that $C$ is finitely generated and the projective dimension of $Kervarphi$ is finite and $varphi$ is surjective.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1987

ISSN: 0012-365X

DOI: 10.1016/0012-365x(87)90202-0